Force-dependent mobility and entropic rectification in tubes of periodically varying geometry
نویسندگان
چکیده
منابع مشابه
Force-dependent mobility and entropic rectification in tubes of periodically varying geometry.
We investigate transport of point Brownian particles in a tube formed by identical periodic compartments of varying diameter, focusing on the effects due to the compartment asymmetry. The paper contains two parts. First, we study the force-dependent mobility of the particle. The mobility is a symmetric non-monotonic function of the driving force, F, when the compartment is symmetric. Compartmen...
متن کاملRectification Through Entropic Barriers
The dynamics of Brownian motion has widespread applications extending from transport in designed micro-channels up to its prominent role for inducing transport in molecular motors and Brownian motors. Here, Brownian transport is studied in micro-sized, two dimensional periodic channels, exhibiting periodically varying cross sections. The particles in addition are subjected to a constant externa...
متن کاملTime Dependent Analysis of Micro-tubes Conveying Nanofluids Under Time-Varying Heat Flux
In this paper the numerical analysis of flow and time dependent heat transfer of micro-tube conveying nanofluid in laminar flow is investigated. In this study, convection heat transfer of nanofluid and base fluid and transient analysis for time-varying heat flux for time step of 0.0001 second are elucidated. It is observed that the pumping power of nanofluid flowing and the maximum temperatur...
متن کاملEntropic Geometry from Logic
1. A finitary probability space (=all probability measures on a fixed finite support) can be faithfully represented by a partial order equipped with a measure of content (e.g. Shannon entropy). 2. This partial order can be obtained via a purely order-theoretic systematic procedure starting from an algebra of properties. This procedure applies to any poset envisioned as an algebra of properties.
متن کاملExploration of Periodically Varying Graphs
We study the computability and complexity of the exploration problem in a class of highly dynamic graphs: periodically varying (PV) graphs, where the edges exist only at some (unknown) times defined by the periodic movements of carriers. These graphs naturally model highly dynamic infrastructure-less networks such as public transports with fixed timetables, low earth orbiting (LEO) satellite sy...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Chemical Physics
سال: 2012
ISSN: 0021-9606,1089-7690
DOI: 10.1063/1.4726193